Variable Length Compression of Codeword Indices for Lossy Compression
نویسندگان
چکیده
منابع مشابه
Cumulant Generating Function of Codeword Lengths in Variable-Length Lossy Compression Allowing Positive Excess Distortion Probability
This paper considers the problem of variable-length lossy source coding. The performance criteria are the excess distortion probability and the cumulant generating function of codeword lengths. We derive a non-asymptotic fundamental limit of the cumulant generating function of codeword lengths allowing positive excess distortion probability. It is shown that the achievability and converse bound...
متن کاملVariable Length Compression for Bitmap Indices
Modern large-scale applications are generating staggering amounts of data. In an effort to summarize and index these data sets, databases often use bitmap indices. These indices have become widely adopted due to their dual properties of (1) being able to leverage fast bit-wise operations for query processing and (2) compressibility. Today, two pervasive bitmap compression schemes employ a varia...
متن کاملA Minimum Description Length Proposal for Lossy Data Compression
We give a development of the theory of lossy data compression from the point of view of statistics. This is partly motivated by the enormous success of the statistical approach in lossless compression, in particular Rissanen’s celebrated Minimum Description Length (MDL) principle. A precise characterization of the fundamental limits of compression performance is given, for arbitrary data source...
متن کاملVariable-length compression allowing errors (extended)
This paper studies the fundamental limits of the minimum average length of variable-length compression when a nonzero error probability ǫ is tolerated. We give non-asymptotic bounds on the minimum average length in terms of Erokhin’s rate-distortion function and we use those bounds to obtain a Gaussian approximation on the speed of approach to the limit which is quite accurate for all but small...
متن کاملLossy Image Compression
Representing image files as simple arrays of pixels is generally very inefficient in terms of memory. Storage space and network bandwidth is limited so it is necessary to compress image files. There are many methods that achieve very high compression ratios by allowing the data to be corrupted in ways that are not easily perceivable to the human eye. A new concept is described, combining fracta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Signal Processing Letters
سال: 2012
ISSN: 1070-9908,1558-2361
DOI: 10.1109/lsp.2012.2223462